Optimum Decoding Performance on the Basis of Multithreshold Algorithms
نویسنده
چکیده
The iterative majority improved decoders are described. They are called multithreshold decoders (MTD). These decoders have a property of convergence to the solution of the optimum decoder with keeping linear complexity of implementation, which one is a property of usual threshold procedures. Different decoding applications are discussed. Experimental results are submitted. Decoder for non-binary MTD considered also.
منابع مشابه
Optimum Decoding Characteristics Achievement on the Basis of Multithreshold Algorithms
The iterative majority improved decoders are described. They are called multithreshold decoders (MTD). These decoders have a property of convergence to the solution of the optimum decoder with keeping linear complexity of implementation, which one is a property of usual threshold procedures. Different decoding applications are discussed. Experimental results are submitted. Decoder realization a...
متن کاملAlgorithm of multithreshold decoding for self-orthogonal codes over Gaussian channels
Multithreshold decoder (MTD) for self-orthogonal codes and its performance over Gaussian channel are reviewed. It’s shown that MTD is in many cases as effective as an optimum decoder. MTD implementation complexity is also discussed.
متن کاملAlgorithm of multithreshold decoding for Gaussian channels
Major principles of the method of the linear codes multithreshhold decoding as search for the global functional extremum for a great number of variables are considered. It was demonstrated that the multithreshold decoding efficiency is close to the results ensured by the optimum exhaustive search methods. Decoding complexity under software and hardware realizations is evaluated.
متن کامل(Report at 9-th ISCTA’07 16-20 July 2007,UK,Ambleside) Non-Binary Multithreshold Decoders with Almost Optimum Performance
The simplest majority type decoders for the character data decoding are described. They are called non-binary multithreshold decoders (QMTD). These decoders have a property of convergence to the solution of the optimum decoder with keeping linear complexity of implementation, which one is property of threshold procedures. Decoder error probabilities are discussed. Experimental results are submi...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کامل